Using CNN for solving two-player zero-sum games

نویسندگان

چکیده

We study a two-player zero-sum game (matrix for short) with the objective of finding saddle point and its value. develop novel convolutional neural network (CNN approach to achieve goal. propose complete training pipeline, including specific CNN model structure handle varying sizes, generating datasets, fitting. The experiment results show that our proposed method outperforms traditional linear programming (LP two regret minimization learning algorithms in terms computational efforts. • use solve games. Concrete are train Our can different sizes untrained generation distributions. shows great potential efficiency.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Two-Player Zero-Sum Repeated Bayesian Games

This paper studies two-player zero-sum repeated Bayesian games in which every player has a private type that is unknown to the other player, and the initial probability of the type of every player is publicly known. The types of players are independently chosen according to the initial probabilities, and are kept the same all through the game. At every stage, players simultaneously choose actio...

متن کامل

Approximate Dynamic Programming for Two-Player Zero-Sum Markov Games

This paper provides an analysis of error propagation in Approximate Dynamic Programming applied to zero-sum two-player Stochastic Games. We provide a novel and unified error propagation analysis in Lp-norm of three well-known algorithms adapted to Stochastic Games (namely Approximate Value Iteration, Approximate Policy Iteration and Approximate Generalized Policy Iteratio,n). We show that we ca...

متن کامل

On the Use of Non-Stationary Strategies for Solving Two-Player Zero-Sum Markov Games

The main contribution of this paper consists in extending several non-stationary Reinforcement Learning (RL) algorithms and their theoretical guarantees to the case of γdiscounted zero-sum Markov Games (MGs). As in the case of Markov Decision Processes (MDPs), non-stationary algorithms are shown to exhibit better performance bounds compared to their stationary counterparts. The obtained bounds ...

متن کامل

Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information

We develop and evaluate a new exact algorithm for finding Nash equilibria of two-player zero-sum extensive-form games with imperfect information. Our approach is based on the sequenceform representation of the game, and uses an algorithmic framework of double-oracle methods that have been used successfully in other classes of games. The algorithm uses an iterative decomposition, solving restric...

متن کامل

Pure strategy equilibria in symmetric two-player zero-sum games

We show that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for existence are provided. We point out that the class of symmetric two-player zero-sum games coincides with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expert Systems With Applications

سال: 2022

ISSN: ['1873-6793', '0957-4174']

DOI: https://doi.org/10.1016/j.eswa.2022.117545